A Lower Bound for Nonadaptive, One-Sided Error Testing of Unateness of Boolean Functions over the Hypercube
نویسندگان
چکیده
A Boolean function f : {0, 1} 7→ {0, 1} is unate if, along each coordinate, the function is either nondecreasing or nonincreasing. In this note, we prove that any nonadaptive, one-sided error unateness tester must make Ω( d log d ) queries. This result improves upon the Ω( d log2 d ) lower bound for the same class of testers due to Chen et al. (STOC, 2017).
منابع مشابه
Testing Unateness of Real-Valued Functions
We give a unateness tester for functions of the form f : [n] → R, where n, d ∈ N and R ⊆ R with query complexity O( log(max(d,n)) ). Previously known unateness testers work only for Boolean functions over the domain {0, 1}. We show that every unateness tester for realvalued functions over hypergrid has query complexity Ω(min{d, |R|}). Consequently, our tester is nearly optimal for real-valued f...
متن کاملBoolean Unateness Testing with Õ(n3/4) Adaptive Queries
We give an adaptive algorithm that tests whether an unknown Boolean function f : {0, 1}n →{0, 1} is unate (i.e. every variable of f is either non-decreasing or non-increasing) or -far from unate with one-sided error and ̃ O(n/ ) many queries. This improves on the best adaptive O(n/ )-query algorithm from Baleshzar, Chakrabarty, Pallavoor, Raskhodnikova and Seshadhri [1] when 1/ n. Combined with...
متن کاملBoolean Unateness Testing with $\widetilde{O}(n^{3/4})$ Adaptive Queries
We give an adaptive algorithm which tests whether an unknown Boolean function f : {0, 1} → {0, 1} is unate, i.e. every variable of f is either non-decreasing or non-increasing, or ε-far from unate with one-sided error using Õ(n/ε) queries. This improves on the best adaptive O(n/ε)-query algorithm from Baleshzar, Chakrabarty, Pallavoor, Raskhodnikova and Seshadhri [BCP17b] when 1/ε n. Combined w...
متن کاملOptimal Unateness Testers for Real-Valued Functions: Adaptivity Helps
We study the problem of testing unateness of functions f : {0, 1}d → R.We give aO( ε ·log d ε )query nonadaptive tester and a O( ε )-query adaptive tester and show that both testers are optimal for a fixed distance parameter ε. Previously known unateness testers worked only for Boolean functions, and their query complexity had worse dependence on the dimension both for the adaptive and the nona...
متن کاملA $\widetilde{O}(n)$ Non-Adaptive Tester for Unateness
Khot and Shinkar (RANDOM, 2016) recently describe an adaptive, O(n log(n)/ε)-query tester for unateness of Boolean functions f : {0, 1}n 7→ {0, 1}. In this note, we describe a simple non-adaptive, O(n log(n/ε)/ε) -query tester for unateness for real-valued functions over the hypercube.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 24 شماره
صفحات -
تاریخ انتشار 2017